Bmap/g/1 Queue under D-policy: Queue Length Analysis
نویسندگان
چکیده
منابع مشابه
The BMAP/G/1 QUEUE: A Tutorial
We present an overview of recent results related to the single server queue with general independent and identically distributed service times and a batch Markovian arrival process (BMAP). The BMAP encompasses a wide range of arrival processes and yet, mathematically, the BMAP/G/I model is a relatively simple matrix generalization of the M/G/l queue. Stationary and transient distributions for t...
متن کاملLogarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کاملFurther Transient Analysis of the BMAP/G/1 Queue
Previously, we derived the two-dimensional transforms of the emptiness function, the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, as well as superpositions of thes...
متن کاملAn Infinite Phase-Size BMAP/M/1 Queue and its Application to Secure Group Communication
We derive the bounds of the mean queue length of an infinite phase size BMAP/M/1 queue which has anM/M/∞-type phase transition, and use them to evaluate the performance of secure group communication. Secure communication inside a groups on an open network is critical to enhance the internet capability. Extending the usual matrix analysis to the operator analysis, we derive a new estimation of t...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کامل